Centralized and Distributed Algorithms for a Cooperative Carrying Task

نویسندگان

  • Atin Gupta
  • Wesley H. Huang
چکیده

Many useful tasks require both mobility and manipulation — one or more mobile robots must move to a given location and perform some task with an object there. Our research has focused on mobile robots with nonprehensile (i.e., nongrasping) manipulators. Such manipulators are mechanically simpler than their prehensile counterparts and have the additional advantage of being able to manipulate a wider variety of parts. In this paper, we present algorithms to enable two mobile robots equipped with two degree-of-freedom “palm” manipulators to cooperatively carry an object. As the robots move, the object may slip on the palms, so the robots must make adjustments, lest they drop the object. We first formulate a centralized algorithm that takes the form of a global policy. The correctness of this algorithm is demonstrated through two properties abstracted from the task mechanics. We then show how this centralized algorithm can be transformed into a distributed algorithm so that each robot can operate autonomously, communicating with the other robot only when necessary to ensure successful execution of the task. We have implemented these algorithms and present our experimental results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology

Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...

متن کامل

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

Distributed Signaling Games

The study of the algorithmic and computational complexity of designing efficient signaling schemes for mechanisms aiming to optimize social welfare or revenue is a recurring theme in recent computer science literature. In reality, however, information is typically not held by a central authority, but is distributed among multiple sources (third-party “mediators”), a fact that dramatically chang...

متن کامل

Agent-based approach for cooperative scheduling

This paper studies the multi-factory production (MFP) network scheduling problem where a number of different individual factories join together to form a MFP network, in which these factories can operate more economically than operating individually. However, in such network which known as virtual production network with self-interested factories with transportation times, each individual facto...

متن کامل

Veri cation of DAG Structures in Cooperative Belief Network Based Multi-agent Systems

Multiply sectioned Bayesian networks (MSBNs) provide a framework for proba-bilistic reasoning in a complex single user oriented system as well as in a cooperative multi-agent distributed interpretation system. During the construction or dynamic formation of a MSBN, automatic veriication of the acyclicity of the overall structure is desired. Well known algorithms for acyclicity test assume a cen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004